Tree based credible set estimation

نویسندگان

چکیده

Estimating a joint Highest Posterior Density credible set for multivariate posterior density is challenging as dimension gets larger. Credible intervals univariate marginals are usually presented ease of computation and visualisation. There often two layers approximation, we may need to compute target which itself only an approximation the true density. We obtain sets estimation trees given by Li et al. (in: Lee, Sugiyama, Luxburg, Guyon, Garnett (eds) Advances in neural information processing systems, Curran Associates Inc, Red Hook, 2016) approximating truncated compact subset $$\mathbb {R}^d$$ this preferred copula construction. These approximate distribution from samples using piecewise constant function defined sequential binary splits. use consistent estimator measure symmetric difference between our estimate HPD samples. This quality can be computed without know set. show how true-posterior-coverage estimated doubly intractable cases where not available. illustrate methods with simulation studies find that competitive existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Locally Adaptive Smoothing for Tree-Based Set Estimation

Tree-based methods similar to CART have recently been utilized for problems where the main goal is to estimate some set of interest. It is often the case that the boundary of the true set is smooth in some sense, however tree-based estimates will not be smooth, as they will be a union of ‘boxes’. We propose a general methodology for smoothing such sets that allows for varying levels of smoothne...

متن کامل

Fast Tree-Based Redistancing forLevel Set Computations

Level set methods for moving interface problems require efficient techniques for transforming an interface to a globally defined function whose zero set is the interface, such as the signed distance to the interface. This paper presents efficient algorithms for this “redistancing” problem. The algorithms use quadtrees and triangulation to compute global approximate signed distance functions. A ...

متن کامل

Unsupervised Discretization Using Tree-Based Density Estimation

This paper presents an unsupervised discretization method that performs density estimation for univariate data. The subintervals that the discretization produces can be used as the bins of a histogram. Histograms are a very simple and broadly understood means for displaying data, and our method automatically adapts bin widths to the data. It uses the log-likelihood as the scoring function to se...

متن کامل

Skeleton-Based Orienteering for Level Set Estimation

In recent years, the use of unmanned vehicles for monitoring spatial environmental phenomena has gained increasing attention. Within this context, an interesting problem is level set estimation, where the goal is to identify regions of space where the analyzed phenomena (for example the PH value in a body of water) is above or below a given threshold level. Typically, in the literature this pro...

متن کامل

Design Based Estimation of Finite Population Mean in Ranked Set Sampling

Abstract. This Article introduce method of ranked set sampling with replacement (RSSWR) in finite population and express how to computing samples of inclusion probability for this method. The Horvitz-Thompson and Hansen-Hurwtz estimators using auxiliary variables introduce for this design and use 2011-12 Urban Households Income and Income and Expenditure survey data, gathered for Tehran by stat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics and Computing

سال: 2021

ISSN: ['0960-3174', '1573-1375']

DOI: https://doi.org/10.1007/s11222-021-10045-3